Histogram Matching SLIC Segmentation Vertex Cover Adjust Clusters Boundary Smoothing Region Colouring Merging

نویسندگان

  • Stained Glass
  • Lars Doyle
چکیده

We propose a new region-based method for stained glass rendering of an input photograph. We achieve more regular region sizes than previous methods by using simple linear iterative clustering, or SLIC, to obtain tile boundaries. The SLIC regions respect image edges but provide an oversegmentation suitable for stained glass. We distinguish between important boundaries that match image edges, and unimportant boundaries that do not; we then resegment regions with unimportant boundaries to create more regular regions. We assign colors to stained glass tiles; lastly, we apply a painting layer to the simplified image, restoring fine details that cannot be conveyed by the tile shapes alone. This last step is analogous to the overpainting done in real-world stained glass. The outcome is a stylized image that offers a better representation of the original image content than has been available from earlier stained glass filters, while still conveying the sense of a stained glass image.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Segmentation using SLIC Superpixels and Affinity Propagation Clustering

In this paper, we propose a new method of image segmentation, named SLICAP, which combines the simple linear iterative clustering (SLIC) method with the affinity propagation (AP) clustering algorithm. First, the SLICAP technique uses the SLIC superpixel algorithm to form an over-segmentation of an image. Then, a similarity is constructed based on the features of superpixels. Finally, the AP alg...

متن کامل

REGION MERGING STRATEGY FOR BRAIN MRI SEGMENTATION USING DEMPSTER-SHAFER THEORY

Detection of brain tissues using magnetic resonance imaging (MRI) is an active and challenging research area in computational neuroscience. Brain MRI artifacts lead to an uncertainty in pixel values. Therefore, brain MRI segmentation is a complicated concern which is tackled by a novel data fusion approach. The proposed algorithm has two main steps. In the first step the brain MRI is divided to...

متن کامل

Peekaboo - Where are the Objects? Structure Adjusting Superpixels

This paper addresses the search for a fast and meaningful image segmentation in the context of k-means clustering. The proposed method builds on a widely-used local version of Lloyd’s algorithm, called Simple Linear Iterative Clustering (SLIC). We propose an algorithm which extends SLIC to dynamically adjust the local search, adopting superpixel resolution dynamically to structure existent in t...

متن کامل

An Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring

1.1 The Problem Let G = (V,E) be a simple undirected graph. A vertex colouring of G assigns colours to each vertex in such a way that neighbours have different colours. In this paper we discuss how efficient (time and bits) vertex colouring may be accomplished by exchange of bits between neighbouring vertices. The distributed complexity of vertex colouring is of fundamental interest for the stu...

متن کامل

Edge Cover Colouring Versus Minimum Degree in Multigraphs

An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover meets each vertex at least once). We aim to determine a tight lower bound on the maximum number of parts in an edge cover colouring as a function of the minimum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016